Rainbow Numbers for Cycles in Plane Triangulations
نویسندگان
چکیده
In the article, the existence of rainbow cycles in edge colored plane triangulations is studied. It is shown that the minimum number rb(Tn,C3) of colors that force the existence of a rainbow C3 in any n-vertex plane triangulation is equal to 3n−4 2 . For k ≥ 4 a lower bound and for k ∈ {4,5} an upper bound of the number rb(Tn,Ck ) is determined. C © 2014 Wiley Periodicals, Inc. J. Graph Theory 00: 1–10, 2014
منابع مشابه
Separating 3-cycles in plane triangulations
The maximal number of separating 3-cycles in a plane triangulation with given order under certain distance conditions between these 3-cycles is determined. Moreover, a construction principle of the class of triangulations possessing the maximal number of separating 3-cycles, which is based on a set of extremal members, is presented. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملOn numbers of pseudo-triangulations
We study the maximum numbers of pseudo-triangulations and pointed pseudotriangulations that can be embedded over a specific set of points in the plane or contained in a specific triangulation. We derive the bounds O(5.45 ) and Ω(2.41 ) for the maximum number of pointed pseudo-triangulations that can be contained in a specific triangulation over a set of N points. For the number of all pseudo-tr...
متن کاملDiagonal flips in Hamiltonian triangulations on the projective plane
In this paper, we shall prove that any two triangulations on the projective plane with n vertices can be transformed into each other by at most 8n− 26 diagonal flips, up to isotopy. To prove it, we focus on triangulations on the projective plane with contractible Hamilton cycles. © 2005 Elsevier B.V. All rights reserved.
متن کاملOn the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations
Tuesday, September 2 12:30–1:20 4119 Harris Hall The question whether for a given graph a hamiltonian cycle exists is NPcomplete, even when restricted to the class of plane triangulations. However, in 1931 Whitney proved a sufficient condition: each plane triangulation containing no non-facial cycle of length 3 is hamiltonian. More than 70 years later, Jackson and Yu succeeded in finding a cons...
متن کاملGeometric variants of Hall's Theorem through Sperner's Lemma
Hall’s marriage theorem can be regarded as a condition for the existence of a rainbow set of distinct points. Motivated by this interpretation, we introduce the notion of geometric Hall-type problems. We prove that a linear Hall-type condition guarantees the existence of a rainbow set of pairwise disjoint unit balls in Rn. We also prove that a quadratic Hall-type condition guarantees the existe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 78 شماره
صفحات -
تاریخ انتشار 2015